Method and apparatus for operating a timer for processing data blocks

ABSTRACT

A timer for processing data blocks is proposed for a receiver of a mobile communications system. If the timer is not running, the timer is started based a data block. The data block has a sequence number higher than a sequence number of another data block that was first expected to be received. If the timer is stopped or expires, the timer is based on a highest sequence number of a data block among data blocks that cannot be delivered to a higher entity. The timer can be used to prevent a stall condition in mobile communications.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation application of prior U.S. patentapplication Ser. No. 13/767,295 filed on Feb. 14, 2013 which is aContinuation application of prior U.S. patent application Ser. No.12/621,129 filed Nov. 18, 2009 (now U.S. Pat. No. 8,400,922), which is aContinuation application of prior U.S. patent application Ser. No.12/104,542 filed Apr. 17, 2008 (now U.S. Pat. No. 8,050,178) which is aContinuation application of prior U.S. patent application Ser. No.10/331,631 filed Dec. 31, 2002 (now U.S. Pat. No. 7,522,526), whichclaims priority under 35 U.S.C. §119 to Korean Application No.10-2002-0000632 filed on Jan. 5, 2002, whose entire disclosures arehereby incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention generally relates to wireless communications, and moreparticularly to a system and method for improving the transmissionefficiency of packet data received by a receiver in a mobile radiocommunications system.

2. Background of the Related Art

A universal mobile telecommunications system (UMTS) is a thirdgeneration mobile communication system that has evolved from a standardknown as Global System for Mobile communications (GSM). This standard isa European standard which aims to provide an improved mobilecommunication service based on a GSM core network and wideband codedivision multiple access (W-CDMA) technology. In December, 1998, theETSI of Europe, the ARIB/TTC of Japan, the T1 of the United States, andthe TTA of Korea formed a Third Generation Partnership Project (3GPP)for the purpose of creating the specification for standardizing theUMTS.

The work towards standardizing the UMTS performed by the 3GPP hasresulted in the formation of five technical specification groups (TSG),each of which is directed to forming network elements having independentoperations. More specifically, each TSG develops, approves, and managesa standard specification in a related region. Among them, a radio accessnetwork (RAN) group (TSG-RAN) develops a specification for the function,items desired, and interface of a UMTS terrestrial radio access network(UTRAN), which is a new RAN for supporting a W-CDMA access technology inthe UMTS.

The TSG-RAN group includes a plenary group and four working groups.Working group 1 (WG1) develops a specification for a physical layer (afirst layer). Working group 2 (WG2) specifies the functions of a datalink layer (a second layer) and a network layer (a third layer). Workinggroup 3 (WG3) defines a specification for an interface among a basestation in the UTRAN, a radio network controller (RNC), and a corenetwork. Finally, Working group 4 (WG4) discusses requirements desiredfor evaluation of radio link performance and items desired for radioresource management.

FIG. 1 shows a structure of a 3GPP UTRAN. This UTRAN 110 includes one ormore radio network sub-systems (RNS) 120 and 130. Each RNS 120 and 130includes a RNC 121 and 131 and one or more Nodes B 122 and 123 and 132and 133 (e.g., a base station) managed by the RNCs. RNCs 121 and 131 areconnected to a mobile switching center (MSC) 141 which performs circuitswitched communications with the GSM network. The RNCs are alsoconnected to a serving general packet radio service support node (SGSN)142 which performs packet switched communications with a general packetradio service (GPRS) network.

Nodes B are managed by the RNCs, receive information sent by thephysical layer of a terminal 150 (e.g., mobile station, user equipmentand/or subscriber unit) through an uplink, and transmit data to aterminal 150 through a downlink. Nodes B, thus, operate as access pointsof the UTRAN for terminal 150.

The RNCs perform functions which include assigning and managing radioresources. An RNC that directly manages a Node B is referred to as acontrol RNC (CRNC). The CRNC manages common radio resources. A servingRNC (SRNC), on the other hand, manages dedicated radio resourcesassigned to the respective terminals. The CRNC can be the same as theSRNC. However, when the terminal deviates from the region of the SRNCand moves to the region of another RNC, the CRNC can be different fromthe SRNC. Because the physical positions of various elements in the UMTSnetwork can vary, an interface for connecting the elements is necessary.Nodes B and the RNCs are connected to each other by an Iub interface.Two RNCs are connected to each other by an Iur interface. An interfacebetween the RNC and a core network is referred to as Iu.

FIG. 2 shows a structure of a radio access interface protocol between aterminal which operates based on a 3GPP RAN specification and a UTRAN.The radio access interface protocol is horizontally formed of a physicallayer (PHY), a data link layer, and a network layer and is verticallydivided into a control plane for transmitting a control information anda user plane for transmitting data information. The user plane is aregion to which traffic information of a user such as voice or an IPpacket is transmitted. The control plane is a region to which controlinformation such as an interface of a network or maintenance andmanagement of a call is transmitted.

In FIG. 2, protocol layers can be divided into a first layer (L1), asecond layer (L2), and a third layer (L3) based on three lower layers ofan open system interconnection (OSI) standard model well known in acommunication system. The first layer (L1) operates as a physical layer(PHY) for a radio interface and is connected to an upper medium accesscontrol (MAC) layer through one or more transport channels. The physicallayer transmits data delivered to the physical layer (PHY) through atransport channel to a receiver using various coding and modulatingmethods suitable for radio circumstances. The transport channel betweenthe physical layer (PHY) and the MAC layer is divided into a dedicatedtransport channel and a common transport channel based on whether it isexclusively used by a single terminal or shared by several terminals.

The second layer L2 operates as a data link layer and lets variousterminals share the radio resources of a W-CDMA network. The secondlayer L2 is divided into the MAC layer, a radio link control (RLC)layer, a packet data convergence protocol (PDCP) layer, and abroadcast/multicast control (BMC) layer.

The MAC layer delivers data through an appropriate mapping relationshipbetween a logical channel and a transport channel. The logical channelsconnect an upper layer to the MAC layer. Various logical channels areprovided according to the kind of transmitted information. In general,when information of the control plane is transmitted, a control channelis used. When information of the user plane is transmitted, a trafficchannel is used. The MAC layer is divided two sub-layers according toperformed functions. The two sub-layers are a MAC-d sub-layer that ispositioned in the SRNC and manages the dedicated transport channel and aMAC-c/sh sub-layer that is positioned in the CRNC and manages the commontransport channel.

The RLC layer forms an appropriate RLC protocol data unit (PDU) suitablefor transmission by the segmentation and concatenation functions of anRLC service data unit (SDU) received from an upper layer. The RLC layeralso performs an automatic repeat request (ARQ) function by which an RLCPDU lost during transmission is re-transmitted. The RLC layer operatesin three modes, a transparent mode (TM), an unacknowledged mode (UM),and an acknowledged mode (AM). The mode selected depends upon the methodused to process the RLC SDU received from the upper layer. An RLC bufferstores the RLC SDUs or the RLC PDUs received from the upper layer existsin the RLC layer.

The packet data convergence protocol (PDCP) layer is an upper layer ofthe RLC layer which allows data items to be transmitted through anetwork protocol such as the IPv4 or the IPv6. A header compressiontechnique for compressing and transmitting the header information in apacket can be used for effective transmission of the IP packet.

The broadcast/multicast control (BMC) layer allows a message to betransmitted from a cell broadcast center (CBC) through the radiointerface. The main function of the BMC layer is scheduling andtransmitting a cell broadcast message to a terminal. In general, data istransmitted through the RLC layer operating in the unacknowledged mode.

The PDCP layer and the BMC layer are connected to the SGSN because apacket switching method is used, and are located only in the user planebecause they transmit only user data. Unlike the PDCP layer and the BMClayer, the RLC layer can be included in the user plane and the controlplane according to a layer connected to the upper layer. When the RLClayer belongs to the control plane, data is received from a radioresource control (RRC) layer. In the other cases, the RLC layer belongsto the user plane. In general, the transmission service of user dataprovided from the user plane to the upper layer by the second layer (L2)is referred to as a radio bearer (RB). The transmission service ofcontrol information provided from the control plane to the upper layerby the second layer (L2) is referred to as a signaling radio bearer(SRB). As shown in FIG. 2, a plurality of entities can exist in the RLCand PDCP layers. This is because a terminal has a plurality of RBs, andone or two RLC entities and only one PDCP entity are generally used forone RB. The entities of the RLC layer and the PDCP layer can perform anindependent function in each layer.

The RRC layer positioned in the lowest portion of the third layer (L3)is defined only in the control plane and controls the logical channels,the transport channels, and the physical channels in relation to thesetup, the reconfiguration, and the release of the RBs. At this time,setting up the RB means processes of stipulating the characteristics ofa protocol layer and a channel, which are required for providing aspecific service, and setting the respective detailed parameters andoperation methods. It is possible to transmit control messages receivedfrom the upper layer through a RRC message.

The aforementioned W-CDMA system attempts to achieve a transmissionspeed of 2 Mbps indoors and in a pico-cell circumstance, and atransmission speed of 384 kbps in a general radio condition. However, asthe wireless Internet becomes more widespread and the number ofsubscribers increases, more diverse services will be provided. In orderto support these services, it is expected that higher transmissionspeeds will be necessary. In the current 3GPP consortium, research isbeing performed to provide high transmission speeds by developing theW-CDMA network. One representative system is known as the high-speeddownlink packet access (HSDPA) system.

The HSDPA system is based on WCDMA. It supports a maximum speed of 10Mbps to the downlink and is expected to provide shorter delay time andan improved capacity than existing systems. The following technologieshave been applied to the HSDPA system in order to provide highertransmission speed and enlarged capacity: link adaptation (LA), hybridautomatic repeat request (HARQ), fast cell selection (FCS), and multipleinput, multiple output (MIMO) antenna.

The LA uses a modulation and coding scheme (MCS) suitable for thecondition of a channel. When the channel condition is good, high degreemodulation such as 16QAM or 64QAM is used. When the channel condition isbad, low degree modulation such as QPSK is used.

In general, low degree modulation methods support a lesser amount oftransmission traffic than high degree modulation methods. However, inlow degree modulation methods, a transmission success ratio is high whena channel condition is not desirable and therefore, it is advantageousto use this form of modulation when the influences of fading orinterference is large. On the other hand, frequency efficiency is betterin high degree modulation methods than in low degree modulation methods.In the high degree modulation methods, it is possible, for example, toachieve a transmission speed of 10 Mbps using the 5 MHz bandwidth ofW-CDMA. However, high degree modulation methods are very sensitive tonoise and interference. Therefore, when a user terminal is located closeto a Node B, it is possible to improve transmission efficiency using16QAM or 64QAM. And, when the terminal is located on the boundary of thecell or when the influence of fading is large, low modulation methodsuch as QPSK is useful.

The HARQ method is a re-transmission method which differs from existingre-transmission methods used in the RLC layer. The HARQ method is usedin connection with the physical layer, and a higher decoding successratio is guaranteed by combining re-transmitted data with previouslyreceived data. That is, a packet that is not successfully transmitted isnot discarded but stored. The stored packet is combined with are-transmitted packet in a step before decoding and is decoded.Therefore, when the HARQ method is used together with the LA, it ispossible to significantly increase the transmission efficiency of thepacket.

The FCS method is similar to a related art soft handover. That is, theterminal can receive data from various cells. However, in considerationof the channel condition of each cell, the terminal receives data from asingle cell which has the best channel condition. The related art softhandover methods increase the transmission success ratio usingdiversity, and more specifically, by receiving data from various cells.However, in the FCS method, data is received from a specific cell inorder to reduce interference between cells.

Regarding the MIMO antenna system, the transmission speed of data isincreased using various independent radio waves propagated in thedispersive channel condition. The MIMO antenna system usually consistsof several transmission antennas and several reception antennas, so thatdiversity gain is obtained by reducing correlation between radio wavesreceived by each antenna.

The HSDPA system, thus, to adopt a new technology based on a WCDMAnetwork. However, in order to graft new technologies, modification isunavoidable. As a representative example, the function of Node B isimproved. That is, though most control functions are located in the RNCin a WCDMA network, new technologies for the HSDPA system are managed bythe Node B in order to achieve faster adjustment to the channelconditions and to reduce a delay time in the RNC. The enhanced functionof the Node B, however, is not meant to replace the functions of the RNCbut rather is intended to supplement these functions for high speed datatransmission, from a point of view of the RNC.

Thus, in an HDSPA system, the Nodes B are modified to perform some ofthe MAC functions unlike in the WCDMA system. A modified layer whichperforms some of the MAC function is referred to as a MAC-hs sub-layer.

The MAC-hs sub-layer is positioned above the physical layer and canperform packet scheduling and LA functions. The MAC-hs sub-layer alsomanages a new transport channel known as HS-DSCH (High Speed-DownlinkShared Channel) which is used for HSDPA data transmission. The HS-DSCHchannel is used when data is exchanged between the MAC-hs sub-layer andthe physical layer.

FIG. 3 shows a radio interface protocol structure for supporting theHSDPA system. As shown, the MAC layer is divided into a MAC-d sub-layer,a MAC-c/sh sub-layer, and a MAC-hs sub-layer. The MAC-hs sub-layer ispositioned above the physical layer (PHY) of a Node B. The MAC-c/sh andMAC-d sub-layers are located in the CRNC and the SRNC. A newtransmission protocol referred to the HS-DSCH frame protocol (FP) isused between the RNC and the Node B or among the RNCs for the deliveryof HSDPA data.

The MAC-c/sh sub-layer, the MAC-d sub-layer, and the RLC layerpositioned above the MAC-hs sub-layer perform the same functions as thecurrent system. Therefore, a slight modification of the current RNC canfully support the HSDPA system.

FIG. 4 shows the structure of a MAC layer used in the HSDPA system. TheMAC layer is divided into a MAC-d sub-layer 161, a MAC-c/sh sub-layer162, and a MAC-hs sub-layer 163. The MAC-d sub layer in the SRNC managesdedicated transport channels for a specific terminal. The MAC-c/shsub-layer in the CRNC manages the common transport channels. The MAC-hssub-layer in the Node B manages the HS-DSCH. In this arrangement, thefunctions performed by the MAC-c/sh sub-layer 162 in the HSDPA systemare reduced. That is, the MAC-c/sh sub-layer assigns common resourcesshared by various terminals in the conventional system and processes thecommon resources. However, in the HSDPA system, the MAC-c/sh sub-layersimply performs a flow control function of the data delivery between theMAC-d sub-layer 161 and the MAC-hs sub-layer 163.

Referring to FIG. 4, it will be described how data received from the RLClayer is processed and delivered to the HS-DSCH in the MAC layer. First,the path of the RLC PDU delivered from the RLC layer through thededicated logical channel, (i.e. a dedicated traffic channel (DTCH) or adedicated control channel (DCCH)), is determined by a channel switchingfunction in the MAC-d layer. When an RLC PDU is delivered to thededicated channel (DCH), a related header is attached to the RLC PDU inthe MAC-d sub-layer 161 and the RLC PDU is delivered to the physicallayer through the DCH. When the HS-DSCH channel of the HSDPA system isused, the RLC PDU is delivered to the MAC-c/s h sub-layer 162 by achannel switching function. When a plurality of logical channels use onetransport channel, the RLC PDU passes through a transport channelmultiplexing block. The identification information (control/traffic(C/T) field) of the logical channel, to which each RLC PDU belongs, isadded during this process. Also, each logical channel has a priority.Data of a logical channel has the same priority.

The MAC-d sub-layer 161 transmits the priority of a MAC-d PDU when theMAC-d PDU is transmitted. The MAC-c/sh sub-layer 162 that received theMAC-d PDU simply passes the data received from the MAC-d sub-layer 161to the MAC-hs sub-layer 163. The MAC-d PDU delivered to the MAC-hssub-layer 163 is stored in the transmission buffer in the schedulingblock. One transmission buffer exists per each priority level. EachMAC-hs SDU (MAC-d PDU) is sequentially stored in the transmission buffercorresponding to its priority.

An appropriate data block size is selected by the scheduling functiondepending on the channel condition. Accordingly, a data block is formedby one or more MAC-hs SDUs.

A priority class identifier and a transmission sequence number are addedto each data block and each data block is delivered to the HARQ block.

A maximum 8 HARQ processes exist in the HARQ block. The data blockreceived from the scheduling block is delivered to an appropriate HARQprocess. Each HARQ process operates in a stop and wait (SAW) ARQ. Inthis method, the next data block is not transmitted until a current datablock is successfully transmitted. As mentioned above, because only onedata block is transmitted in a TTI, only one HARQ process is activatedin one TTI.

Another HARQ processes waits until its turn. Each HARQ process has aHARQ process identifier. A corresponding HARQ process identifier ispreviously known to the terminal through a downlink control signal, sothat a specific data block passes through the same HARQ process in thetransmitter (the UTRAN) and the receiver (the terminal). The HARQprocess that transmitted the data block also stores the data block toprovision the future re-transmission. The HARQ process, re-transmits thedata block when NonACKnowledge (NACK) is received from the terminal.

When ACK is received from the terminal, the HARQ process deletes thecorresponding data block and prepares the transmission of a new datablock. When the data block is transmitted, a transport format andresource combination (TFRC) block selects an appropriate TFC for theHS-DSCH.

FIG. 5 shows a structure of the MAC layer of the terminal used in theHSDPA system. This MAC layer is divided into a MAC-d sub-layer 173, aMAC-c/sh sub-layer 172, and a MAC-hs sub-layer 171. Unlike the UTRAN,the above three layers are located in the same place. The MAC-dsub-layer and the MAC-c/sh sub-layer in the terminal are almost same asthose in the UTRAN, but the MAC-hs sub-layer 171 is slightly differentbecause the MAC-hs sub-layer in the UTRAN performs only transmission andthe MAC-hs sub-layer in the terminal performs only reception.

The manner in which the MAC layer receives the data from the physicallayer and delivers it to the RLC layer will now be described. The datablock delivered to the MAC-hs sub-layer 171 through the HS-DSCH is firststored in one of the HARQ processes in the HARQ block. In which processthe data block is stored can be known from the HARQ process identifierincluded in the downlink control signal.

The HARQ process, in which the data block is stored, transmits the NACKinformation to the UTRAN when there are errors in the data block andrequests the re-transmission of the data block. When no errors exist,the HARQ process delivers the data block to a reordering buffer andtransmits the ACK information to the UTRAN. A reordering buffer has apriority like the transmission buffer in the UTRAN. The HARQ processdelivers the data block to the corresponding reordering buffer with theaid of a priority class identifier included in the data block. Asignificant characteristic of the reordering buffer is that it supportsin-sequence delivery of data.

Data blocks are sequentially delivered to an upper layer based on atransmission sequence number (TSN). More specifically, when a data blockis received while one or more previous data blocks are missing, the datablock is stored in the reordering buffer and is not delivered to theupper layer. Rather, the stored data block is delivered to the upperlayer only when all previous data blocks are received and delivered tothe upper layer. Because several HARQ processes operate, a reorderingbuffer may receive data blocks out of sequence. Therefore, anin-sequence delivery function is used for the reordering buffer so thatthe data blocks can be delivered to the upper layer sequentially.

One difference between the reordering buffer of the terminal and thetransmission buffer of the UTRAN is that the reordering buffer storesdata in units of data block which is composed of one or more MAC-hsSDUs, while the transmission buffer stores data in units of MAC-hs SDU(=MAC-d PDU). Because the MAC-d sub-layer 173 processes data in units ofMAC-d PDUs, when the reordering buffer of the terminal MAC-hs sub-layer171 delivers the data block to the MAC-d sub-layer 173, the reorderingbuffer must first disassemble the data block into the MAC-d PDUs andthen deliver them to the MAC-d sub-layer. The MAC-c/sh sub-layer 172passes the MAC-d PDUs received from the MAC-hs sub-layer 171 to theMAC-d sub-layer. The MAC-d sub-layer 173 that received the MAC-d PDUchecks the logical channel identifier (CFI field) included in each MAC-dPDU in the transport channel multiplexing block and delivers the MAC-dPDUs to the RLC through the corresponding logical channel.

FIG. 6 shows processes for transmitting and receiving a data block in anHSDPA system. The MAC-d PDUs are actually stored in a transmissionbuffer 180. However, for the sake of convenience, it is shown as a datablock (=one or more MAC-d PDUs). The sizes of the respective data blockscan vary. However, the sizes are shown to be the same because the datablocks for illustrative purposes. Also, it is assumed that eight HARQprocesses 181 through 188 exist.

The process includes transmitting data blocks to the receiver for datablocks having transmission sequence numbers from TSN=13 to TSN=22 in thetransmission buffer. A data block with a lower TSN is served first to anempty HARQ process. For example, as shown, the data block TSN=13 isdelivered to HARQ process #1 181, and data block TSN=14 is delivered toHARQ process #8. From this explanation, it is clear that the TSN is notrelated to the HARQ process number.

When the HARQ process receives an arbitrary data block, the HARQ processtransmits the data block to the receiver in a specific TTI and storesthe data block for re-transmission that might be performed later. Onlyone data block can be transmitted in a certain TTI. Accordingly, onlyone HARQ process is activated in a single TTI. The HARQ process thattransmitted the data block informs the receiver of its process numberthrough a downlink control signal which is transmitted through adifferent channel than that of the data block.

The reason why the HARQ process of the transmitter coincides with theHARQ process of the receiver is that a stop-and-wait ARQ method is usedby each HARQ process pair. That is, HARQ process #1 181 that transmitteddata block TSN=13 does not transmit another data block until the datablock is successfully transmitted. Because a receiver HARQ process #1191 can know that data is transmitted thereto for a corresponding TTIthrough the downlink control signal, the receiver HARQ process #1transmits the NACK information to the transmitter through an uplinkcontrol signal when the data block is not successfully received within adefined transmission time interval (TTI). On the other hand, when a datablock is successfully received, the receiver HARQ process #1 transmitsthe ACK information to the transmitter, and at the same time deliversthe corresponding data block to the reordering buffer according to thepriority.

The reordering buffer exists per priority level. The HARQ process checksthe priority included in the header information of the data block anddelivers the data block to the reordering buffer according to thepriority. The data block delivered to the reordering buffer is thendelivered to the upper layer when all of the previous data blocks aredelivered to the upper layer. However, when one or more previous datablocks are not delivered to the upper layer, the data block is stored inthe reordering buffer 190. That is, the reordering buffer must supportin-sequence delivery of data blocks to the upper layer. A data blockthat is not delivered to the upper layer is stored in the reorderingbuffer.

To illustrate the foregoing, FIG. 6 shows that when data block TSN=14 isreceived but data block TSN=13 is not received, data block TSN=14 isstored in the reordering buffer until data block TSN=13 is received.When data block TSN=13 is received, both data blocks are delivered tothe upper layer in the order of TSN=13 and TSN=14. When the data blocksare delivered to the upper layer, they are disassembled in units ofMAC-d PDUs and are delivered as described above.

The reordering buffer delivery process is susceptible to a stallcondition which may be described as follows. Because the reorderingbuffer supports in-sequence delivery of data blocks, when a specificdata block is not received data blocks having later TSNs are notdelivered to the upper layer but rather are stored in the reorderingbuffer. When a specific data block is not received for a long time orpermanently, the data blocks in the reordering buffer are not deliveredto the upper layer. Moreover, after a short period of time, additionaldata blocks cannot be received because the buffer becomes full, therebyresulting in a stall situation.

When stall occurs and a specific data block cannot be delivered for along time or ever, the transmission efficiency of the HSDPA systemdeteriorates. More specifically, when a large number of data blocks arestored in the buffer of the MAC-hs for a long time due to a singlemissing data block, the entire data transmission efficiency of thesystem is reduced. This undermines many of the advantages of the HSDPAsystem, such as its ability to provide high-speed data communications.

In an attempt to overcome this problem, related methods take thefollowing approach. When the receiver does not successfully receive adata block for a certain amount of time, the receiver stops waiting forthe missing data block and delivers subsequently received data blocks tothe upper layer. As a result, all the data blocks that were successfullyreceived and stored in the reordering buffer are lost and consequentlyquality of communications and transmission efficiency is diminished.

Incidentally, it is noted that a data block may not be receivedpermanently because of one of the following two reasons:

1) The UTRAN misinterprets the NACK signal sent by the terminal as anACK signal; and

2) The HARQ process of the UTRAN discards the corresponding data blockbecause the data block has been re-transmitted a maximum number of timesallowable by the system or the transmission is not successfullyperformed for a defined time.

In case 1), the UTRAN wrongly decodes status information sent by theterminal. In case 2), the UTRAN discards the specific data block becausethe transmission of the specific data block has not been successful fora long time. The UTRAN, however, does not inform the terminal of thisfact. In this case, because the corresponding data block is nottransmitted permanently, later data blocks are stored in the reorderingbuffer without being delivered to the upper layer. Therefore, a protocolis stalled, which is a big problem.

A need therefore exists for an improved method of increasing theefficiency and quality of voice and data transmissions in a mobilecommunications system, and more specifically one which is able toachieve these advantages while simultaneously correcting a stallcondition in a reordering buffer of a communications receiver.

SUMMARY OF THE INVENTION

It is one object of the present invention to provide a system and methodfor improving the quality of communications in a mobile communicationssystem.

It is another object of the present invention to achieve theaforementioned object by preventing a stall condition in a user terminalin a way that simultaneously improves the transmission efficiency of thesystem.

It is another object of the present invention to achieve theaforementioned object using a stall timer which limits the amount oftime data blocks are stored in a reordering buffer of the receiver.

It is another object of the present invention to set a period of thestall timer to a value which prevents a wrap-around condition fromoccurring with respect to transmission sequence numbers assigned to datablocks stored in the buffer.

It is another object of the present invention to provide a system andmethod which prevents a stall condition in a reordering buffer andsimultaneously prevents correctly received data blocks stored in thebuffer from being lost.

These and other objects and advantages of the present invention areachieved by providing a method which prevents a stall condition in auser terminal by receiving a data block SN, detecting that a data blockhaving a transmission sequence number which precedes a transmissionsequence number of data block SN has not been received, storing datablock SN in a reordering buffer, and outputting data block SN from thebuffer when a first period of a timer expires. The user terminal may beconfigured to operate, for example, within a high-speed downlinkpacket-access (HSDPA) mobile communications system, and the reorderingbuffer is preferably implemented in a MAC layer of the terminal. Ifimplemented in this manner, the buffer may receive data blocks from aphysical layer via a HS-DSCH channel and may output data blocks to anupper layer such as an RLC layer.

Additional steps of the method include receiving the preceding datablock during the first timer period and then delivering the precedingdata block and data block SN to the upper layer. The preceding datablock may be delivered in one of a variety of ways. In accordance withone embodiment, the preceding data block and data block SN may bedelivered to the intended destination when the first timer periodexpires. Advantageously, this step may be performed even if at least oneother data block having a preceding transmission sequence number has notbeen received.

In accordance with another embodiment, if the preceding data block isreceived before the first timer period expires and the preceding datablock is the only missing data block preceding data block SN, thepreceding data block and data block SN are delivered to the intendeddestination and the timer is stopped.

In accordance with another embodiment, a plurality of data blocks havingpreceding transmission sequence numbers are detected to be missing at atime when data block SN is received. In this case, when at least one ofthe preceding data blocks is received before the first timer periodexpires, the received preceding data block is immediately delivered tothe intended destination if it has not anticipated missing data blockspreceding it. Otherwise, the received preceding data block is deliveredwith data block SN after the first timer period expires.

In accordance with another embodiment, a data block having a succeedingtransmission sequence number is received during the first timer period.Data block SN and the succeeding data block are then delivered to anintended destination when the first timer period expires, but only ifthe succeeding data block and data block SN have consecutivetransmission sequence numbers.

In accordance with another embodiment, a data block having a succeedingtransmission sequence number is received during the first timer period.When this occurs, the preceding data block and data block SN aredelivered to an intended destination when the first timer periodexpires, and the succeeding data block is also delivered when the firsttimer period expires but only if data block SN and the succeeding datablock have consecutive transmission sequence numbers.

In accordance with another embodiment, a plurality of data blocks havingsucceeding transmission sequence numbers are received during the firsttimer period. When this occurs, the plurality of succeeding data blocksare delivered with data block SN to an intended destination when thefirst timer period expires but only if data block SN and the pluralityof succeeding data blocks have consecutive transmission sequencenumbers.

In accordance with another embodiment, a plurality of data blocks havingsucceeding transmission sequence numbers are received, and it isdetected that there is at least one missing data block M in theplurality of succeeding data blocks. Data block SN and one or more ofthe succeeding blocks may have consecutive transmission sequencenumbers, and missing data block M may have a transmission sequencenumber which comes after the transmission sequence numbers of the one ormore succeeding data blocks that consecutively follow the transmissionsequence number of data block SN. When this occurs, the one or more datablocks having transmission sequence numbers that consecutively followthe transmission sequence number of data block SN are delivered to anintended destination when the first timer period expires. The delivereddata blocks are then discarded from the buffer and the remainingsucceeding data blocks (i.e., ones having transmission sequence numbersthat come after the transmission sequence number of data block M) arestored in the buffer.

In accordance with another embodiment, a second period of the timer maybe started based on the remaining succeeding block having a highesttransmission sequence number. When this occurs, each of the remainingsucceeding data blocks is delivered to an intended destination after allthe anticipated missing data blocks preceding it are received or afterthe second timer period expires.

The present invention is also a computer program having respective codesections which perform steps included in any of the embodiments of themethod of the present invention discussed herein. The computer programmay be written in any computer language supportable within a userterminal, and may be stored on a permanent or removablecomputer-readable medium within or interfaced to the terminal.

The present invention is also a method for controlling a reorderingbuffer. The buffer is preferably located within a communicationsreceiver, but may also be implemented in other portions of acommunications system if desired. The method includes providing a timerwhich controls storage of data blocks in the buffer, and setting aperiod of the timer to a value which prevents a wrap-around oftransmission serial numbers assigned to the data blocks from occurring.

In accordance with another embodiment, a method for processing packetdata in a receiver of a communications system receives a data blockhaving a sequence number, stores the data block in a reordering buffer,and starts a timer for the reordering buffer if a data block of apreceding sequence number is missing. Here, the timer is the only timerprovided for controlling the reordering buffer. Preferably, the timer isstarted only when the data block of the preceding sequence number ismissing and the timer is not active.

Additional steps of the method include determining whether the datablock can be immediately delivered to an upper layer. If yes, the datablock is delivered to the upper layer without ever storing it in thereordering buffer. If not, the data block is stored in the reorderingbuffer. Also, the step of determining whether the time is active may beperformed before the starting step. If the timer is active the startingstep may not be performed.

Additional steps include receiving at least one additional data blockafter the timer has been started and storing the at least one additionaldata block in the reordering buffer. The additional data block may havea preceding sequence number. In this case, the additional block may beremoved from the buffer and delivered to an upper layer when there is noanticipated missing data block preceding it or when the timer expires.The additional data block may have a succeeding sequence number. In thiscase, the additional block may be removed from the reordering buffer anddelivered to an upper layer when the timer expires if the succeedingsequence number of the additional data block consecutively follows thedata block having said sequence number. If the sequence number of theadditional block does not consecutively follow, then the additionalblock may continue to be stored in the buffer after the timer expires.The timer may then be re-started for the data block stored in the bufferhaving the highest sequence number in the buffer.

In accordance with another embodiment, a method for processing packetdata in a receiver of a communications system includes starting a timerfor a reordering buffer, receiving a data block having a sequencenumber, storing the data block in the reordering buffer, and removingthe data block from the reordering buffer when the timer expires if thesequence number of the data block precedes a sequence number of a datablock received and stored in the reordering buffer at a time when thetimer was started.

In accordance with another embodiment, the present invention provides auser terminal which includes a reordering buffer for storing a datablock having a sequence number, a timer, and a controller which startssaid timer for the reordering buffer if a data block of a precedingsequence number is missing, wherein said timer is the only timerprovided for controlling the reordering buffer. The controller startssaid timer if the data block of said preceding sequence number ismissing and the timer is not active. The controller may also determinewhether the data block of said preceding sequence number can beimmediately delivered to an upper layer. The buffer will store the datablock of said preceding sequence number in the reordering buffer if thedata block cannot immediately be delivered to the upper layer. If thedata block can be immediately delivered, the buffer outputs the block toan upper layer.

The reordering buffer also stores at least one additional data block inthe reordering buffer at the timer has started. The additional datablock may be the missing data block having said preceding sequencenumber. If so, the additional block is removed from the reorderingbuffer and delivered to the upper layer when the timer expires. Theadditional block may also be a succeeding sequence number. If so, thedata block is removed from the reordering buffer and delivered to anupper layer when the timer expires if its succeeding sequence numberconsecutively follows the data block having said sequence number.

The reordering buffer will continue to store the additional data blockin the reordering buffer after the timer expires if the succeedingsequence number of the additional data block does not consecutivelyfollow the data block having said sequence number. In this case, thecontroller will determine a data block stored in the buffer having ahighest sequence number and will then re-start the timer.

In accordance with another embodiment, a method for processing packetdata in a receiver of a communications system includes receiving datablocks, storing the data blocks in a reordering buffer, starting a timerfor the reordering buffer, and delivering the data blocks from thereordering buffer to an upper layer when the timer expires. In thisembodiment, in the delivering step the data blocks are deliveredsequentially but may not in-sequence manner. The difference ofsequential delivery from the in-sequence delivery is that in this casethe sequence numbers of two adjacently delivered data blocks can be notconsecutive. That is, a missing data block is allowed between thedelivered data blocks. For example, delivered data blocks have followingsequence numbers 14, 15, 17, 19, 24, 25, 26, 28, . . . . Missing datablock is allowed, but should be delivered sequentially. If we apply thein-sequence delivery to the above example, the data blocks of sequencenumber higher than 16 should not be delivered until the data block 16 isdelivered. The sequence number of the delivered data blocks must be: 14,15, 16, 17, 18, 19, . . . . Missing data block is not allowed, andshould be delivered sequentially. On the contrary, a reordering buffermay receive data blocks out of sequence. In this case, theout-of-sequence reception means a reordering buffer may receive datablocks with upper TSN earlier than data blocks with lower TSN. Forexample, a reordering buffer receives data blocks like this: 15, 20, 14,16, 23, 24, 17, 18, . . . .

The present invention represents a significant improvement overconventional methods of preventing a stall condition in a communicationsystem. By delivering correctly received data blocks that wouldotherwise be lost in a conventional system, the invention improvestransmission efficiency and the quality of communications at thereceiver. The invention also removes the cumulative delay problem thattends to arise in a receiver as a result of a TSN wrap-around condition.Through these improvements, the invention will allow user terminals tomeet or exceed the performance standards required by so-callednext-generation wireless systems.

Additional advantages, objects, and features of the invention will beset forth in part in the description which follows and in part willbecome apparent to those having ordinary skill in the art uponexamination of the following or may be learned from practice of theinvention. The objects and advantages of the invention may be realizedand attained as particularly pointed out in the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be described in detail with reference to thefollowing drawings in which like reference numerals refer to likeelements wherein:

FIG. 1 shows a structure of a 3GPP UTRAN in a 3GPP communicationssystem.

FIG. 2 shows a structure of a radio access interface protocol between aterminal which operates based on a 3GPP RAN specification and a UTRAN.

FIG. 3 shows a radio interface protocol structure for supporting theHSDPA system.

FIG. 4 shows the structure of a MAC layer used in the HSDPA system,which layer includes a MAC-d sub-layer, a MAC-c/sh sub-layer, and aMAC-hs sub-layer.

FIG. 5 shows a structure of the MAC layer of a user terminal in an HSDPAsystem.

FIG. 6 shows a process for transmitting and receiving a data block in anHSDPA system.

FIG. 7 shows a user terminal in accordance with a preferred embodimentof the invention.

FIGS. 8A-8C show steps included in a method for avoiding a stallcondition in a reordering buffer in accordance with one embodiment ofthe present invention.

FIG. 9 shows a timing diagram illustrating a first control procedure inaccordance with the present invention.

FIGS. 10A and 10B show another embodiment of the method of the presentinvention for avoiding a stall condition in an HSDPA system.

FIGS. 11A-11C illustrate how the maximum value of a stall timer periodT1 may be calculated for a worst case scenario.

FIGS. 12A and 12B show an example of how the method of the presentinvention may operate a stall timer for managing the storage of datablocks in a reordering buffer in a way that avoids a stall condition.

FIG. 13 shows an example of how the method of the present invention isapplied to a situation where the sequence numbers of data blocks storedin a reordering buffer begin to be reused.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

The present invention is a system and method for preventing a stallcondition in a user terminal of a mobile communications system. Theinvention is preferably implemented in a mobile network such as theUniversal Mobile Telecommunications System (UMTS) currently beingdeveloped by the third-generation partnership project (3GPP). Thoseskilled in the art can appreciate, however, that the invention mayalternatively be adapted for use in communications systems which operateaccording to other standards. The present invention is also a userterminal which implements the method of the present invention forpreventing a stall condition from occurring. The present invention isalso a computer program which may be stored in the user terminal forimplementing the method of the present invention. A detailed discussionof embodiments of the invention will now be provided.

The invention is ideally suited for use in a high-speed downlinkpacket-access (HSDPA) mobile system. Systems of this type include userequipment which communicates with a UMTS Terrestrial Radio AccessNetwork (UTRAN) through a wireless link. The user equipment may include,for example, a mobile telephone, a personal digital assistant, aso-called pocket PC, a laptop or notebook computer, or any other devicewhich receives signals wirelessly transmitted over a mobilecommunications network. As previously discussed, these signals may betransmitted by a UTRAN and received by a user terminal operating inaccordance with the protocol architecture shown, for example, in FIGS.1-3, 5, and 6.

When implemented in this manner, the method of the present inventioncontrols the storage of data blocks within and the subsequent transferand deletion of data blocks from a reordering buffer operating withinthe medium access control (MAC) layer of the user terminal. Morespecifically, the reordering buffer may be located in a MAC-hssub-layer, which receives data blocks from a lower-level physical layerand transfers those blocks to an upper layer such as the radio linkcontrol (RLC) layer through MAC-c/sh and MAC-d sub-layers respectively.These features were previously discussed at length with reference to,for example, FIG. 5 and therefore a detailed discussion of them will notbe provided here.

FIG. 7 is a diagram showing a user terminal in accordance with apreferred embodiment of the invention. The terminal includescircuits/software for performing the method which will be described ingreater detail below. At this point, it is sufficient to note that thesecircuits/software are preferably incorporated within a MAC-hs entity300, which receives data blocks from a peer entity of a UTRAN through aplurality of high-speed downlink shared channels (HS-DSCHs) 302 anddelivers those data blocks to a MAC-d sub-layer by way of a MAC-c/shsub-layer through a series of dedicated transport channels (DCHs) 308.The MAC-hs entity and the peer entity of UTRAN exchange messages andother control forms of control information through downlink and uplinkchannels 304 and 306 respectively.

The MAC-hs entity includes a HARQ unit 310, a reordering queuedistribution unit 320, one or more reordering buffers 330 preferablywith an equal number of stall timers 340, a plurality of disassemblyunits 350, and an input for receiving control signals from a MAC layercontroller 360 for managing the functions and operations performed inthe MAC-hs entity.

The HARQ unit performs MAC functions relating to the HARQ protocol whichinclude but are not limited to all tasks required for hybrid ARQ. TheHARQ unit also transmits acknowledgment (ACK) and non-acknowledgment(NACK) signals indicating whether data blocks transmitted by the peerentity of the UTRAN have been received. The HARQ unit includes aplurality of HARQ processes 310-1 to 310-n which preferably operate inparallel. The number of HARQ processes may be determined by one or moreof the upper layers of the protocol. In operation, each HARQ processtransfer data blocks from an HS-DSCH channel to a reordering bufferbased on priority class identification information in headers of theblocks. The data blocks include or may be in the form of MAC-hs protocoldata units (PDUs) or service data units (SDUs).

The reordering queue distribution unit routes the data blocks to thecorrect reordering buffer based on queue identification (ID) informationin the header of each block. This information provides, for example, anindication of the reordering queue that may be used to supportindependent buffer handling of data belonging to different reorderingqueues.

The reordering buffers reorder data blocks from the reordering queuedistribution unit based on transmission sequence numbers (TSNs) inheaders of the blocks. The buffers then deliver those blocks in sequenceto an upper layer. Delivery of the blocks may be performed as follows.In each buffer, data blocks with consecutive TSNs are delivered to anassociated disassembly unit upon reception. A data block, however, isnot immediately delivered to a disassembly function if one or morepreceding data blocks (e.g., ones having lower transmission sequencenumbers) were not received. In this case, the data blocks aretemporarily stored in the reordering buffer and then output undercontrol of the stall timer of the present invention, discussed ingreater detail below. One reordering buffer may be provided for eachqueue ID, and each transmission sequence number may be provided withrespect to a specific reordering buffer. TSN and queue ID informationmay be inserted into the headers of each data block by a scheduler andHARQ process entity located in the UTRAN.

The disassembly units disassemble data blocks output from the reorderingbuffers respectively. If the data blocks include MAC-hs PDUs, they aredisassembled by removing header information, extracting MAC-d PDUs, andremoving any padding bits that may be present. The MAC-d PDUs are thendelivered to an upper layer.

The stall timers control when data blocks are output from the reorderingbuffers. Preferably, one stall timer is provided for each reorderingbuffer. As those skilled in the art can appreciate, multiple timers maybe used but one is sufficient. The stall timer for each buffer isinitially activated when a data block cannot immediately be delivered toan upper layer. This occurs when one or more preceding data blocks(e.g., ones having lower transmission sequence numbers) were notreceived. The following rule therefore governs when a data block isstored in the buffer and when a stall timer is initially activated: datablocks may be delivered to an upper layer only when all previous datablocks are received and delivered.

When the aforementioned rule is initially violated, a received datablock is temporarily stored in the buffer for a period of timedetermined by the stall timer. Depending on the embodiment of theinvention, this period of time may equal one or more stall timerperiods. The stall timer period is preferably set by upper layers of theprotocol. This period is preferably set to ensure that a transmissionsequence number wrap-around condition does not occur. The manner inwhich the stall timer is set is discussed in greater detail below.

FIGS. 8A-8C show steps included in a method for avoiding a stallcondition in a reordering buffer of a protocol layer of a receiver inaccordance with one embodiment of the present invention. Referring toFIG. 8A, the method includes as an initial step receiving a data blockwith a sequence number SN from a peer entity of the transmitter vialower layers such as a physical layer through an HS-DSCH channel. (Block400).

A second step includes determining whether or not the received datablock can be delivered to the upper layer. (Block 401). This step isperformed based on whether one or more previous data blocks was notreceived. If at least one data block having a transmission sequencenumber that precedes the transmission sequence number of the receiveddata block has not been received, the received data block (with atransmission sequence number of TSN) is not delivered to the upper layerbut stored in the reordering buffer. (Block 402). The missing datablock(s) may be detected, for example, by comparing the transmissionsequence number in the header of the newly received data block with thetransmission sequence number of a last-delivered data block. If thesenumbers are not sequential, then a missing data block may be determinedto exist and the number of missing blocks may be determined based on thedifference between these numbers. These functions may be performed undercontrol of the MAC controller in conjunction with, for example, thereordering queue distribution and HARQ units.

Under these circumstances, even though data block TSN was correctlyreceived, it may not be immediately delivered to an upper layer becausedata block TSN−1 is missing. (Those skilled in the art can appreciatethat the foregoing example is not to be limiting of the presentinvention, as there may be more than one missing data block between thelast-delivered data block and data block SN.) When this occurs, datablock SN is temporarily stored in the reordering buffer. If all datablocks having preceding transmission sequence numbers have beendelivered within the time frame under consideration, then data block SNis not stored in the buffer but rather is automatically delivered to theupper layer. (Block 403).

A next step includes determining whether a stall timer provided for thebuffer is active. (Block 404). If the timer is active, then noadditional timer is started since only one timer is provided for eachreordering buffer. This step may be restated as follows:

If a timer T1 is already active:

-   -   no additional timer shall be started, i.e., only one timer T1        may be active at a given time.

If the stall timer is not active, the timer is started and runs for apredetermined period, which may be determined by the MAC controllerand/or one or more upper layers of the protocol (Block 405). These stepsmay be restated as follows:

If no timer T1 is active:

-   -   the timer T1 shall be started when a MAC-hs PDU with TSN=SN is        correctly received but cannot be delivered to the disassembly        function because the MAC-hs PDU with TSN equal to        Next_expected_TSN is missing.        Here, the term “next-expected-TSN” means a TSN of a data block        which should be received next time if the data blocks are        received in sequence.

Referring to FIG. 8B, the conditions for stopping the stall timer andactions after the stop and expiration of the stall timer will beexplained. Once a stall timer is started, it is determined whether datablock TSN for which the stall timer was started is delivered to theupper layer before expiration of the timer period. (Block 411). If thedata block for which the stall timer was started is delivered to theupper layer before this time, the stall timer is stopped (Block 420).These steps may be restated as follows:

The timer T1 shall be stopped if:

-   -   the MAC-hs PDU for which the timer was started can be delivered        to the disassembly function before the timer expires.

If the data block has not been delivered to the upper layer during theperiod of the stall timer, the following steps may be performed. First,all data blocks that are received during the period of the stall timerare placed in the reordering buffer preferably in sequence if thereceived data block cannot be delivered to the upper layer. (Block 410).Thus, for example, in case that the stall timer is started for the datablock SN with the data blocks from SN−4 to SN−1 are missing, and if datablocks SN−4, SN−2, and SN−1 are received during the period of the stalltimer, the data block SN−4 is immediately delivered to the upper layer,and the data blocks SN−2 and SN−1 are stored in the reordering buffer.

When the stall timer period expires, the data blocks stored in thereordering buffer up to the data block of SN for which the stall timerwas started will be treated appropriately. (Block 413). Among the datablocks stored up to data block SN, all correctly received but notdelivered data blocks are sequentially delivered to an upper layer.These data blocks may then be removed from the buffer to make room forsubsequently received data blocks. These steps may be restated asfollows:

When the timer T1 expires:

-   -   all correctly received MAC-hs PDUs up to and including SN−1        shall be delivered to the disassembly function and be removed        from the reordering buffer.        Of course, it is understood in this re-stated language that data        block SN is also delivered at this time after all the preceding        data blocks are delivered.

The method of the present invention may perform the following additionalsteps as a way of further improving transmission efficiency. During thestall timer period, data blocks having transmission sequence numbersgreater than data block SN (e.g., data blocks SN+1, SN+2, etc.) may bereceived, in addition to the preceding data blocks (e.g., data blocksSN−1, SN−2, etc.). Because at least one preceding data block has notbeen delivered, these succeeding data blocks may not be delivered.Instead, they are stored in the reordering buffer in sequence with datablock of SN.

When the stall timer period expires, the method of the present inventionmay advantageously deliver all data blocks stored in the reorderingbuffer that have transmission sequence numbers that consecutively followdata block SN. (Block 414).

It is possible that one or more succeeding data blocks may not bereceived during the stall timer period. For example, data blocks SN+1,SN+2, and SN+4 may have been received but data block SN+3 may not bereceived. In this case, the method of the present invention may deliverall succeeding data blocks stored in the reordering buffer up to thefirst missing data block SN+3. Thus, data blocks SN+1 and SN+2 may bedelivered at the time the stall timer expires, but data block SN+4 maybe left in the reordering buffer. After delivering data blocks SN+1 andSN+2, the next-expected-TSN becomes SN+3. Delivering these succeedingdata blocks further improves transmission efficiency and therefore ishighly desirable. These steps of the invention may be re-stated asfollows:

When the timer T1 expires:

-   -   all correctly received MAC-hs PDUs up to the first missing        MAC-hs PDU shall be delivered to the disassembly function.

When one or more succeeding data blocks are missing in the reorderingbuffer at a time when the stall timer expires or when the stall timer isstopped because data block SN is delivered prior to timer expiration,the method of the present invention may follow a control procedure,which may represent another embodiment of the invention.

The control procedure, shown in FIG. 8C, includes re-starting the timerbased on the data block of highest transmission sequence number(hereinafter referred to as HSN) that is the last number of the cyclicorder of the sequence numbers of the data blocks stored in thereordering buffer at the time the stall timer expired or was stopped.(Blocks 412, 420). This step may therefore be re-stated as follows:

-   -   When the timer T1 is stopped or expires, and there still exist        some received MAC-hs PDUs that cannot be delivered to the higher        layer:        -   timer T1 is started for the MAC-hs PDU with highest TSN            among those MAC-hs PDUs that cannot be delivered.            In the above step, it is noted that there may only be a            finite number of transmission sequence numbers that can be            assigned to data blocks. In this case, transmission sequence            numbers must therefore be reused. It is therefore possible            under these circumstances that the last data block stored in            the reordering buffer is not in fact the one having the            highest transmission sequence number. Therefore, the highest            transmission sequence number (HSN) is the last number of the            cyclic order of the sequence numbers of the data blocks            stored in the reordering buffer, instead of the largest            transmission sequence number.

The data block of HSN or the data block in the buffer having the highesttransmission sequence number may correspond to the last data block of apart of a circulation of the transmission sequence number.

The behavior of the reordering buffer for the re-started stall timer isthe same for the previous stall timer. During the re-started timerperiod, all data blocks preceding data block HSN may be received anddelivered to the upper layer. If so, the data block HSN is delivered tothe upper layer (Block 411) and the stall timer is stopped (Block 420).

If at least one data block preceding data block HSN is not receivedbefore the restarted stall timer period expires, the data block HSN andother received but not delivered data blocks are stored in thereordering buffer in proper sequence. When the re-started timer periodexpires (Block 412), among the data blocks up to the data block HSN allcorrectly received but undelivered data blocks are sequentiallydelivered to the upper layer. (Block 413). Among the data blockssucceeding data block HSN, all in-sequence data blocks are alsodelivered to the upper layer. The delivered data blocks are thendiscarded from the buffer. (Block 413). After delivering all possibledata blocks, if one or more data blocks still remain in the reorderingbuffer, the stall timer restarts for the data block of new HSN, and thecontrol procedure begins again. If no data blocks are left in thebuffer, the stall timer becomes inactive and the reordering buffer waitsfor the next data block, i.e., the whose procedure begins again.

FIG. 9 shows a timing diagram for an exemplary control procedure thatmay be performed in accordance with the present invention. This diagramshows that before the stall timer is started for the first time, datablocks SN 13 and SN 14 are received and delivered to the upper layer.Because all previous data blocks have been delivered, data blocks SN 13and SN 14 are also delivered without delay to an upper layer. At thistime, the next-expected-TSN is SN 15. The next data block received afterdata block SN 14 is SN 18. Since the data blocks SN 15, SN 16, and SN 17are not received yet, the received data block SN 18 cannot be deliveredto the upper layer. Under these conditions, data block SN 18 is storedin the reordering buffer and the stall timer is started.

When the stall timer is first started, the reordering buffer may onlycontain data block SN 18. At the end of the first timer period, datablock SN 16 is received along with succeeding data blocks SN 19, SN 20,SN 22, SN 23, and SN 25. Data blocks SN 21 and SN 24, however, aremissing along with SN 15 and SN 17. At this time, data blocks SN 16, SN18, SN 19, and SN 20 are delivered to the upper layer and are alsodiscarded from the reordering buffer. Data blocks SN 22, SN 23, and SN25 are not delivered at this time because one of the preceding datablock SN 21 is missing. Therefore, the stall timer is re-started for asecond time based on data block SN 25. All received data blocks up toand including data block SN 25 will be delivered at the end of thesecond timer period, even if data blocks SN 21 and SN 24 are notreceived by this time. Among the stored data blocks succeeding datablock 25, all in-sequence data blocks are also delivered to the upperlayer at this time. The delivered data blocks in the buffer are thendiscarded and the method begins again depending on whether there is anydata block left in the reordering buffer.

FIGS. 10A and 10B show another embodiment of the method of the presentinvention for avoiding a stall condition in an HSDPA system. Now, theterm “data block DB” is defined as the data block for which the stalltimer is started and “data block M” as the data block that is receivedduring the stall timer period. As shown in FIG. 10A, this methodincludes as an initial step determining whether a data block DB has beenreceived from the physical layer in a medium access control layer of theuser equipment (Block 501). The data block may be received through anHS-DSCH channel connected to one of a plurality of HARQ processesincluded in the MAC layer. In terms of content, the data blockpreferably includes header information and one or more MAC-hs SDUs (orMAC-d PDUs). The HARQ processes may deliver data blocks to a reorderingbuffer in the MAC layer based on priority level information included inthe data block headers.

When data block DB is received, a next step of the method includesdetermining whether the received data block DB may be delivered to anupper layer, such as a radio link control layer (Block 502). This stepmay be performed based on the following rule: a data block received bythe MAC layer cannot be delivered to an upper layer unless and until allimmediately preceding data blocks have been delivered. If one or moreimmediately preceding data blocks have not been received by the MAClayer (i.e., are missing from an input data stream), the data block DBis not delivered to the upper layer upon receipt. Instead, a check isperformed to determine whether a stall timer assigned to control areordering buffer is active. (Block 503).

Data blocks may be determined to be missing based on a comparison of thetransmission sequence number of the received data block DB and, forexample, a transmission sequence number of a last-delivered data block.If the two sequence numbers are not in succession, then the differencebetween the sequence numbers may be used as a basis for determining howmany missing data blocks exist (i.e., were not received) before thereceived data block DB.

If the stall timer is determined to be inactive, the stall timer isactivated (Block 504) and the received data block is stored in thereordering buffer (Block 505). The subsequently received data blocks areeither delivered to the upper layer or stored in the reordering bufferdepending on their transmission sequence numbers TSNs. If the TSN of thereceived data block M consecutively follows the TSN of thelast-delivered data block, i.e., if the received data block M is thedata block of the Next-expected-TSN, then the received data block M isdelivered to the upper layer without being stored in the reorderingbuffer. But if the TSN of the received data block M does notconsecutively follow the TSN of the last-delivered data block, i.e., ifthere are one or more missing data blocks preceding the received datablock M, then the received data block M is stored in the reorderingbuffer based on its transmission sequence number TSN. The data block Mstored in the reordering buffer is delivered to the upper layer onlyafter all the preceding data blocks are received and delivered to theupper layer or, if the data block M has not been delivered to the upperlayer until the stall timer expires, after the stall timer expires. Themanner in which the count period of the stall timer is set is discussedin greater detail below. At this time, it is sufficient to understandthat the count period is preferably set to a value which ensures that awrap-around condition does not occur.

An example of the foregoing may be given as follows. In this example,the following events occur one by one. Each step occurs for each TTI(Transmission Time Interval=2 ms). Assume that before this procedure theNET (Next-expected-TSN)=9.

-   -   1. Data block 9 is received→delivered to the upper layer,        NET=10.    -   2. Data block 15 is received→stored in the reordering buffer and        the stall timer starts    -   3. Data block 20 is received→stored in the reordering buffer.    -   4. Data block 10 is received→delivered to the upper layer,        NET=11.    -   5. Data block 14 is received→stored in the reordering buffer    -   6. Data block 16 is received→stored in the reordering buffer    -   7. Data block 18 is received→stored in the reordering buffer    -   8. Data block 12 is received→stored in the reordering buffer    -   9. Data block 11 is received→data blocks 11 and 12 are delivered        to the upper layer, NET=13    -   10. Stall timer expires.        -   i. Data blocks 14, 15, and 16 are delivered to the upper            layer, NET=17        -   ii. Stall timer re-starts for the data block 20. (At the            time the stall timer re-starts, data blocks 18 and 20 are            still left in the reordering buffer and data blocks 17 and            19 have not yet been received).

If the stall timer is determined to already be active, this means that astall timer condition has arisen with respect to a data block which hasbeen previously received and stored in the reordering buffer. That is,the currently received data block is the data block M in the aboveexample, and the stall timer is already started for the previouslyreceived data block DB. In this situation, the received and thesubsequently received data blocks are either delivered to the upperlayer or stored in the reordering buffer depending on their transmissionsequence numbers TSNs. The received and the subsequently received datablocks are preferably stored based on their transmission sequencenumbers TSNs. The stored data blocks are delivered to the upper layeronly after all the preceding data blocks are received and delivered tothe upper layer or after the stall timer period expires.

During the period when the timer is active, data blocks may continue tobe received and stored in the reordering buffer. These data blocks mayinclude the missing data blocks that were determined to precede datablock DB as well as successively received data blocks, i.e., ones havingtransmission sequence numbers greater than the transmission sequencenumber of data block DB. The situation may arise, however, that onlysome or even none of the preceding data blocks are received during thistime. Also, one or more of the successive data blocks may not bereceived. (This may be determined based on a comparison of transmissionsequence numbers of the subsequently received data blocks.)

In a next step, it is determined whether the stall timer has expired(Block 506). When the stall timer expires, among the data blockspreceding the data block DB, all data blocks which have been receivedprior to timer expiration but not delivered to the upper layer aredelivered to the upper layer with data block DB. In accordance with thepresent invention, this is advantageously performed even when allpreceding data blocks were not received prior to timer expiration. Underthese circumstances, as shown in FIG. 10B, the MAC layer (and preferablythe MAC-hs sub-layer) transmits information to the transmitter (e.g.,the UTRAN) identifying which preceding data blocks were not receivedwithin the timer period (Block 507). The transmitter may, in response,cease all efforts to re-transmit the missing data blocks.

In a next step, the successively received data blocks stored in thereordering buffer are examined to determine whether they can also bedelivered with data block DB (Block 508). This involves comparing thetransmission sequence numbers of the remaining data blocks stored in thereordering buffer with the transmission sequence number of data blockDB. All remaining data blocks stored in the reordering buffer which havetransmission sequence numbers that consecutively follow the transmissionsequence number of data block DB are preferably delivered to the upperlayer. The cut-off point for delivery of these successive data blocksmay be a missing data block.

To illustrate the foregoing step, if data block DB has a transmissionsequence number equal to 10 and data blocks having transmission sequencenumbers equal to 11, 12, and 14 are stored in the reordering buffer,then data blocks 11 and 12 are delivered to the upper layer preferablyafter delivery of data block 10. Because the data block havingtransmission sequence number 13 is missing (i.e., was not yet received),data block 14 and all data blocks stored thereafter are not deliveredbut left in the reordering buffer. For efficiency purposes, all datablocks which have been delivered may be deleted from the buffer.

It is possible that all remaining data blocks stored in the reorderingbuffer have consecutively successive transmission sequence numbers. Inthis case, all remaining data blocks in the reordering buffer aredelivered to the upper layer with data block DB upon timer expiration,and the stall timer becomes inactive. On the other hand, if there is anydata block remaining in the reordering buffer due to one or more missingdata blocks, the stall timer is re-started for the data block with thehighest transmission sequence number among the remaining data blocks inthe reordering buffer. This will be further described in a next step.

When the stall timer expires, after all the possible data blocks aredelivered to the upper layer, a check is performed to determine whetherany data blocks are left in the reordering buffer (Block 509). If not,the method returns to Block 501 for a next TTI without re-starting thetimer, i.e., the stall timer becomes inactive. If any data blocks areleft in the reordering buffer, the stall timer is re-started forpurposes of delivering all remaining data blocks stored in thereordering buffer (Block 510). More specifically, the stall timer isre-started for the data block of HSN in the reordering buffer, which maycorrespond to the one having the highest transmission sequence number.

During the period of the re-started timer, some preceding and successivedata blocks may be received like in the previous stall timer period. Thereceived data blocks are either delivered to the upper layer or storedin the reordering buffer depending on their transmission sequencenumbers TSNs. When the re-started timer expires, the same procedure isperformed as in the case when the previous stall timer period expires.That is, all stored preceding data blocks and the data block for whichthe stall timer re-started (e.g., the one having the highesttransmission sequence number at the time when the previous stall timeexpires) are delivered to the upper layer. Among the stored successivedata blocks, the data blocks up to the first missing data block are alsodelivered to the upper layer. After these data blocks are delivered,they are preferably discarded from the reordering buffer.

Delivery of the data blocks to an upper layer such as an RLC layer mayinvolve a step of disassembling the blocks into MAC-d PDUs. Thedisassembled blocks may then be delivered to the MAC-d sub-layer throughthe MAC-c/sh layer before reaching the RLC layer.

Additional steps of the method address the situation where a receiveddata block can be delivered to an upper layer. This occurs, for example,when immediately preceding data blocks have been received and deliveredto the upper layer. When this situation arises, the received data blockis not stored in the reordering buffer. Instead, it is immediatelydelivered to the upper layer along with all received data blocks havingsuccessive transmission sequence numbers. (Block 521).

After delivering all possible data blocks to the upper layer, a check isperformed to determine whether data block DB (which started the stalltimer) has been delivered to an upper layer (Block 522). If so, thestall timer may be stopped and re-set for later use (Block 523). If theconditions in Block 522 are not met, then the method continues to waituntil the stall timer expires, whereupon the options stemming from stepS106 are performed as previously discussed.

The stall timer may be controlled by one or more upper layers of theprotocol such as an upper radio resource control (RRC) layer. This layerpreferably sets the timer to a period that will ensure that wrap-aroundin the reordering buffer will not occur. This condition occurs when theperiod of the stall timer is set too long, so that different data blockshaving the same or redundant transmission sequence numbers are stored inthe buffer.

Whether or not a wrap-around condition will occur depends on the rangeof possible transmission numbers that can be assigned to data blockswithin the user equipment. For example, if a maximum of 64 transmissionsequence numbers (0 to 63) can be assigned, then the 1st and 65th datablocks transmitted from the UTRAN will be redundantly assigned atransmission serial number of 0. If stall timer period is set to allowthese data blocks to be stored in the reordering buffer at the sametime, then a wrap-around condition will occur.

The present invention may advantageously set the period of the stalltimer to ensure that this wrap-around condition does not occur. This maybe accomplished by having the RRC determine the maximum value of thetransmission sequence numbers that can be set and then determining theduration of one TTI. Since the maximum delay is less than 2×T1, thewrap-around condition may be avoided by setting the maximum stall timerperiod T1 to a proper value. In accordance with embodiment of thepresent invention, when transmission sequence numbers lie within a rangeof 0 and 63 and one TTI is 2 ms, the RRC may set the period of the stalltimer so that it does not exceed 64 ms (=2 ms 64/2). This may beunderstood as follows.

FIGS. 11A-11C illustrate how the maximum value of the stall timer periodT1 may be calculated for a worst case scenario. FIG. 11A shows that adata block whose transmission sequence number is SN1 is received butthat an immediately preceding data block was not. As previouslydiscussed, when this occurs the stall timer may be started for datablock SN1.

FIG. 11B shows that while the stall timer is running, all successivedata blocks having transmission sequence numbers except data block SN4are received. Here, it may be assumed that data block SN4 will never bereceived, for example, because the UTRAN mis-interpreted anon-acknowledgment signal (NACK) transmitted from the user equipmentrequesting re-transmission of a data block as an acknowledgment signalor because the UTRAN mistakenly deleted the data block and thereforecannot re-transmit it to the user equipment.

When the stall timer expires, data block SN1 is delivered to the higherlayer, but the other received data blocks up to and including data blockSN2 cannot be delivered because of missing data block SN4. Instead,these blocks are maintained in the buffer and the stall timer isre-started (or alternatively, a second stall timer 2 is started) for thedata block of HSN, which in this case is data block SN2. Theoretically,the highest value of transmission sequence number SN2=SN1+T1/(2 ms).

FIG. 11C shows that during the second period of the stall timer, allsuccessive data blocks are correctly received. At the expiration of thesecond timer period, the last data block received and stored in thereordering buffer is data block SN3. Theoretically, the maximum value oftransmission sequence number SN3=SN2+T1/(2 ms)=SN1+T1. Therefore, therange of the data blocks that can be received by the receiver during thesecond stall timer period is [SN4, SN3]=[SN+1, SN1+T1].

As mentioned, the range of transmission sequence numbers which can beassigned to data blocks is 0 to 63. Therefore, when the transmissionsequence number SN3 is equal to or larger than the transmission sequencenumber SN4+64, the user equipment receiver cannot determine whethersubsequently received data blocks are before or after data block SN2shown in the figure. This wrap-around condition occurs because there areonly a limited number of transmission sequence numbers that can beassigned to the data blocks.

To prevent a wrap-around condition from occurring, the Inventors of thepresent invention have determined that the transmission sequence numberSN3 should be less than or equal to SN4+64. The maximum value of SN3 maybe expressed as SN3=SN4+64-1=SN1+64. That is because SN3=SN1+T1, themaximum value of T1 must theoretically be 64 ms. Thus, if the stalltimer period T1 is set to a value of less than or equal to 64 ms, theTSN wrap-around condition will not occur. The RRC of the presentinvention may control the stall timer in accordance with these criteriawith respect to the manner in which operation of the reordering bufferis managed.

In general, when the range of transmission sequence numbers to beassigned to data blocks is N numbers and the TTI is 2 ms, the maximumvalue of the period of the stall timer must be N×TTI/2. When the periodof the stall timer is larger than 64 ms, in the worst case a new datablock having a same or redundant transmission sequence number as that ofa data block previously stored in the reordering buffer can be receivedbefore the stall timer expires. However, in this case, one of the twodata blocks and preferably the redundantly numbered data block isdiscarded. Therefore, in order to prevent transmission sequence numberwrap-around when the range of TSN numbers is 64 and the TTI is 2 ms, themaximum period of the stall timer should be no greater than 64 ms.

In operation, it is preferable for the UTRAN not to transmit (orre-transmit) a data block that was not received within the time periodof 2×T1. This is because the maximum reception standby time the receivercan wait for a data block is 2×T1 without violating the wrap-aroundcondition. Data blocks re-transmitted after this time are preferablydiscarded in the user equipment even if correctly received. Therefore, adiscard timer is preferably provided for each HARQ process in the UTRAN,and the period of the discard timer is preferably set to no more thantwice the stall timer period in the user equipment receiver.

FIGS. 12A and 12B show an example of how the method of the presentinvention may operate a stall timer for managing the storage of datablocks in a reordering buffer in a way that avoids a stall condition.

Initially, the medium access control (MAC) layer in, for example, amobile terminal receiver sequentially receives data blocks havingtransmission sequence numbers 13 and 14 respectively. Becauseimmediately preceding data block were delivered to the upper layer, datablocks 13 and 14 are not stored in the reordering buffer but rather arealso delivered to the upper layer. However, when the data block having atransmission sequence number of 18 is received, it is detected thatpreceding data blocks 15, 16, and 17 were not received. Consequently,data block 18 is stored in the reordering buffer and the stall timer isstarted. At the time the stall timer is started, it is noted that onlydata block 18 is stored in the reordering buffer. This situation isreflected in FIG. 12A.

During the period of the stall timer, the MAC layer monitors which datablocks are received. As shown in FIG. 12B, data block 16 is receivedduring this time along with data blocks 18, 19, 20, 22, 23, and 25. Datablocks 21 and 24 were detected as not being received.

When the stall timer period expires, in accordance with the presentinvention data block 16 is delivered with data block 18. Also, becausedata blocks 19 and 20 sequentially follow block 18 in terms oftransmission sequence numbers (i.e., because no missing data blockexists between block 18 and blocks 19 and 20), data blocks 19 and 20 aredelivered to the upper layer without further delay. All delivered datablocks may be deleted from the reordering buffer, for example, to makeroom for storing subsequently received data blocks. Also, the MAC layerof the user equipment may transmit a message instructing the UTRAN notto re-transmit data blocks 15 and 17 if these blocks were not receivedprior to expiration of the timer period.

Data blocks 22, 23, and 25 are not delivered when the stall timerexpires because data block 21 was not received. Instead, the data blockof HSN stored in the reordering buffer at the time the stall timerexpired is detected.

In this case, the data block of HSN 25 corresponds to the one having thehighest transmission number in the reordering buffer. This may notalways be the case however. Since there is only a finite range oftransmission sequence number that can be assigned to data blocks, it maybe the case that a succession of data blocks 63, 0, 1, and 2 are storedin the reordering buffer. In this case, the data block of HSN would notcorrespond to the data block having the largest transmission sequencenumber. This case is illustratively shown in FIG. 13. The presentinvention is therefore preferably performed to re-start the stall timerto coincide with the data block of HSN in the buffer and not necessarilythe data block having the highest transmission sequence number.

After the data block of HSN in the buffer is detected, the stall timeris re-started. During this time, additional data blocks are received,some of which may include missing data blocks 21 and 24. When data block21 is received during the stall timer period, the data blocks 21, 22,and 23 are sequentially delivered to the upper layer. And then, if datablock 24 is also received during the stall timer period, the data blocks24, 25, and the consecutively successive data blocks are delivered tothe upper layer and the stall timer stops. But, if data blocks 21 and 24are not received during the stall timer period, the data blocks 22, 23,and 25 and the consecutively successive data blocks are delivered to theupper layer only after the stall timer expires. The delivered blocks arethen discarded from the buffer and the process continues.

Concerning this embodiment of the invention, preferably a reorderingbuffer may be controlled by only one stall timer.

Another embodiment of the method of the present invention for preventinga stall condition may be performed in user equipment containing the sameMAC layer structure as in the first embodiment. The manner in which thereordering buffer is controlled, however, is different.

In connection with this embodiment, the following definitions may apply.The term “Next_expected_TSN” corresponds to a transmission sequencenumber which follows the transmission sequence number of the lastin-sequence MAC-hs protocol data unit (PDU) received. It shall beupdated upon receipt of the MAC-hs PDU with a transmission sequencenumber equal to Next_expected_TSN. An initial value ofNext_expected_TSN=0.

In this embodiment, a stall timer controls a reordering buffer in theMAC layer, and more specifically the MAC-hs sub-layer, of the userterminal. The stall timer period may be controlled by upper layers toavoid the wrap-around condition previously discussed.

Initially, it is noted that the stall timer T1 is inactive. The stalltimer is started when a MAC-hs PDU with TSN=SN is correctly received bythe user terminal, but cannot be delivered to a correspondingdisassembly function because the MAC-hs PDU with TSN equal toNext_expected_TSN is missing. While the stall timer is already active,no additional stall timers or timer periods may be started, i.e., onlyone timer T1 may be active at any given time.

The stall timer T1 will be stopped if the MAC-hs PDU for which the timerwas started can be delivered to the disassembly function before thestall timer T1 expires.

When the stall timer T1 expires, all correctly received MAC-hs PDUs upto and including SN−1 are delivered to the disassembly function. Thedelivered MAC-hs PDUs are then removed from the reordering buffer. Also,all correctly received MAC-hs PDUs up to the first missing MAC-hs PDUfollowing, for example, MAC-hs PDU of SN, are delivered to thedisassembly function.

When the timer T1 is stopped or expires and there still exists somereceived MAC-hs PDUs that cannot be delivered to an upper layer, thestall timer T1 is re-started for the MAS-hs PDU with the highesttransmission sequence number among those MAC-hs PDUs that cannot bedelivered.

All received MAC-has PDUs having consecutive transmission sequencenumbers (TSNs) from Next_expected_TSN up to the first not receivedMAC-has PDU are delivered to the disassembly entity. The TSN of thefirst not received MAC-hs PDU becomes the Next_expected_TSN.

The present invention is also a computer program having respective codesections which perform steps included in any of the embodiments of themethod of the present invention discussed herein. The computer programmay be written in any computer language supportable within a userterminal, and may be stored on a permanent or removablecomputer-readable medium within or interfaced to the terminal. Permanentcomputer-readable mediums include but are not limited to read-onlymemories and random-access memories. Removable mediums include but arenot limited to EPROMs, EEPROMs, any one of a number of so-called memorysticks or cards, or any other type of removable storage medium. Flashmemories may also be used to store the computer program of theinvention.

It is noted that the present invention has been adopted in 3GPPTechnical Specification TS 25.308 covering UTRA High Speed DownlinkPacket Access (HSDPA)—Overall Description, and 3GPP TechnicalSpecification TS 25.321 covering the MAC Protocol Specification. Thesedocuments are incorporated herein by reference.

Other modifications and variations to the invention will be apparent tothose skilled in the art from the foregoing disclosure. Thus, while onlycertain embodiments of the invention have been specifically describedherein, it will be apparent that numerous modifications may be madethereto without departing from the spirit and scope of the invention.

The foregoing embodiments and advantages are merely exemplary and arenot to be construed as limiting the present invention. The presentteaching can be readily applied to other types of apparatuses. Thedescription of the present invention is intended to be illustrative, andnot to limit the scope of the claims. Many alternatives, modifications,and variations will be apparent to those skilled in the art. In theclaims, means-plus-function clauses are intended to cover the structuresdescribed herein as performing the recited function and not onlystructural equivalents but also equivalent structures.

What is claimed is:
 1. A method of operating a timer for processing datablocks by a terminal in a communications system, the method comprising:storing, by the terminal, a data block with a sequence number in abuffer; starting, by the terminal, a timer when the data block with thesequence number is stored in the buffer; and if the timer expires,starting, by the terminal, the timer based on a highest sequence numberof a data block among first data blocks that cannot be delivered to ahigher entity.
 2. The method of claim 1, further comprising: if thetimer expires, delivering, by the terminal, second data blocks that canbe delivered to the higher entity.
 3. The method of claim 2, wherein thesteps are performed at a medium access control (MAC) layer of theterminal.
 4. The method of claim 1, wherein the higher entity is amedium access control-dedicated (MAC-d) sub-layer.
 5. The method ofclaim 1, wherein the higher entity is a radio link control (RLC) layer.6. The method of claim 1, wherein no additional timer is started if thetimer is running.
 7. The method of claim 2, wherein the second datablocks are delivered to the higher entity in sequence.
 8. The method ofclaim 1, wherein the data block with the sequence number and the datablock among the first data blocks are medium access control-high speed(MAC-hs) protocol data units.
 9. The method of claim 1, furthercomprising: receiving, by the terminal, the data block with the sequencenumber before storing the data block with the sequence number in thebuffer.
 10. A terminal in a communications system, the terminalcomprising: a buffer configured to store a data block with a sequencenumber; and a timer configured to, start the timer when the data blockwith the sequence number is stored in the buffer, and if the timerexpires, start the timer based on a highest sequence number of a datablock among first data blocks that cannot be delivered to a higherentity.
 11. The terminal of claim 10, further comprising: a lower entityconfigured to deliver second data blocks that can be delivered to thehigher entity if the timer expires.
 12. The terminal of claim 11,wherein the lower entity is a medium access control (MAC) layer of theterminal.
 13. The terminal of claim 10, wherein the higher entity is amedium access control-dedicated (MAC-d) sub-layer.
 14. The terminal ofclaim 10, wherein the higher entity is a radio link control (RLC) layer.15. The terminal of claim 10, wherein no additional timer is started ifthe timer is running.
 16. The terminal of claim 11, wherein the seconddata blocks are delivered to the higher entity in sequence.
 17. Theterminal of claim 10, wherein the data block with the sequence numberand the data block among the first data blocks are medium accesscontrol-high speed (MAC-hs) protocol data units.
 18. The terminal ofclaim 10, further comprising: a lower entity configured to receive thedata block with the sequence number before storing the data block withthe sequence number in the buffer.